搜索资源列表
16-queens
- 16(N)皇后问题，用回溯法和位运算结合编程，在效率上有很大的改进-16 (N) queens problem using backtracking and bitwise combination of programming, a great improvement on the efficiency
n-queen
- N皇后问题、图着色问题、矩阵连乘问题代码实现-N-queens problem, graph coloring problems, matrix multiplicative code implementation
n-huang-hou-wenti
- 在C语言环境下编写的N皇后问题，采用的是回溯法实现的-N-queens problem written in C language environment, backtracking implemented
N-queen
- 简单的N皇后算法，基于vc2008实现，基于回退法-The simple N Queens algorithm, based vc2008
N-queen
- n皇后问题回溯法经典问题 主要用回溯法剖析n皇后问题-n queens problem back method Classic
N-quenes-problem
- N皇后问题，本程序采用二维数组处理N皇后问题，可由用户在运行过程中决定棋盘规格及皇后数目。-N queens problem, the program uses a two-dimensional array processing N-queens problem, decide the number of board specifications and Queen by the user during operation.
TabuSearch-for-N-Queen-Problem
- Tabu Search解N皇后问题 禁忌搜索算法求解N皇后问题-Tabu Search solution of the N-Queens problem tabu search algorithm for solving the N-queens problem
N--java-
- 利用递归机制，可以很容易的求解n皇后问题。针对八皇后，总共有92种解。下面将给出N-皇后问题的一般求解代码，在这里代码是使用java编码的。-Recursive mechanism that can easily solve the n-queens problem. For eight queens, a total of 92 kinds of solutions. The following will give a general N-queens problem solving code
N-QWEENS
- 经典的N皇后问题，运用递归方法求解，具有一定参考价值-Classic N queens problem, using a recursive method for solving a certain reference value
n-Queen
- 在n*n格的棋盘上放置彼此不受攻击的n皇后。按照国际想起的规则，皇后可以攻击与之处在同一行或同一列或同一斜线上的棋子。n后问题等价于在n*n格的棋盘上放置n个皇后，任何2个皇后不放在同一行或同一列或同一斜线了。-Place each n is not an attack on the queen n* n chessboard grid. Think of in accordance with international rules, the Queen can attack at a pawn
N-huanghou
- N皇后回溯算法 课上使用小例子 仅供参考 -N Queens backtracking algorithm using a small example of the class
n-queen
- 在n×n的棋盘上摆放n个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上。-Placed on board nn n queens, it can not attack each other, that any two queen can not be on the same line, same column or diagonal.
n-queen
- n皇后问题的最简单解法，弄够帮助到大家。-n queens problem the easiest solution, get enough help to you.
eight-queens
- 八皇后问题，包括BFS，DFS和回溯法运算。也可以解决n皇后问题。- Eight queens problem, including BFS, DFS and backtracking operations. N queens problem can be solved.
N-Queue_DFS
- BFS法求解N皇后问题，输出全部解决方案。-BFS method for solving N queens problem and output all solutions.
N-Queens
- This is a C code for solving the N queen problem
BFS 求解 N 皇后问题(252370)
- BFS算法实现N皇后问题，12个皇后是速度还行，超过了就有点慢。(BFS algorithm to achieve N queen problem, 12 queens is the speed is OK, more than a little slow.)
爬山 完美
- 使用爬山法实现n皇后问题 输入 n，并用运行时间比较几种算法在相同规模的问题时的求解效率。列表给出结果。 比较同一算法在 n 不相同时的运行时间，分析算法的时间复杂性。(Use of climbing method to achieve the N Queens)
N皇后
- 八皇后问题，是一个古老而著名的问题，是回溯算法的典型案例。该问题是国际西洋棋棋手马克斯·贝瑟尔于1848年提出：在8×8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。(The eight queen problem, an old and famous problem, is a typical case of backtracking algorithms. It is put forward the internationa
Queen
- 用java语言，基于回溯法实现N皇后的位置放置方案，程序可以通过参数来设置要解决几个皇后的放置，默认是4个。(Using java language, backtracking method is used to implement the placement plan of N queens. The program can be set by parameters to solve the placement of several queens, and the default is 4.)